package com.sxkiler.demo.medium;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
letter-case-permutation=字母大小写全排列
<p>给定一个字符串<code>S</code>，通过将字符串<code>S</code>中的每个字母转变大小写，我们可以获得一个新的字符串。返回所有可能得到的字符串集合。</p>

<p>&nbsp;</p>

<pre><strong>示例：</strong>
<strong>输入：</strong>S = "a1b2"
<strong>输出：</strong>["a1b2", "a1B2", "A1b2", "A1B2"]

<strong>输入：</strong>S = "3z4"
<strong>输出：</strong>["3z4", "3Z4"]

<strong>输入：</strong>S = "12345"
<strong>输出：</strong>["12345"]
</pre>

<p>&nbsp;</p>

<p><strong>提示：</strong></p>

<ul>
	<li><code>S</code>&nbsp;的长度不超过<code>12</code>。</li>
	<li><code>S</code>&nbsp;仅由数字和字母组成。</li>
</ul>

 */
public class letterCasePermutation {
    

    class Solution {
        public List<String> letterCasePermutation(String param0) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        "a1b2"
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

